Parallel Repetition of the Odd Cycle Game
نویسندگان
چکیده
Higher powers of the Odd Cycle Game has been the focus of recent investigations [3,4]. In [4] it was shown that if we repeat the game d times in parallel, the winning probability is upper bounded by 1 −Ω( √
منابع مشابه
Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs
Given a two-player one-round game G with value val(G) = (1 − η), how quickly does the value decay under parallel repetition? If G is a projection game, then it is known that we can guarantee val(G⊗n) ≤ (1− η), and that this is optimal. An important question is under what conditions can we guarantee that strong parallel repetition holds, i.e. val(G⊗) ≤ (1− η)? In this work, we show a strong para...
متن کاملInformation Value of Two-Prover Games
We introduce a generalization of the standard framework for studying the difficulty of two-prover games. Specifically, we study the model where Alice and Bob are allowed to communicate (with information constraints) – in contrast to the usual two-prover game where they are not allowed to communicate after receiving their respective input. We study the trade-off between the information cost of t...
متن کاملOn Symmetric Parallel Repetition : Towards Equivalence of MAX-CUT and UG
Unique Games Conjecture (UGC), proposed by [24], lies in the center of many inapproximability results. At the heart of UGC lies approximability of MAX-CUT, which is a special instance of Unique Game. [25, 29] showed that assuming Unique Games Conjecture, it is NPhard to distinguish between MAX-CUT instance that has a value 1 − ε vs. 1 − Ω( √ ε). [14] then showed a matching polynomial time algor...
متن کاملOn the Parallel Repetition of Multi-Player Games: The No-Signaling Case
We consider the natural extension of two-player nonlocal games to an arbitrary number of players. An important question for such nonlocal games is their behavior under parallel repetition. For two-player nonlocal games, it is known that both the classical and the non-signaling value of any game converges to zero exponentially fast under parallel repetition, given that the game is non-trivial to...
متن کاملMultiplayer Parallel Repetition for Expanding Games
We investigate the value of parallel repetition of one-round games with any number of players k ≥ 2. It has been an open question whether an analogue of Raz’s Parallel Repetition Theorem holds for games with more than two players, i.e., whether the value of the repeated game decays exponentially with the number of repetitions. Verbitsky has shown, via a reduction to the density Hales-Jewett the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008